Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa

Synchronization Expressions: Characterization Results and Implementation

Synchronization expressions are deened as restricted regular expressions that specify synchronization constraints between parallel processes and their semantics is deened using synchronization languages. In this paper we survey results on synchronization languages, in particular various approaches to obtain an exact characterization of this language class using closure properties under a set of...

742 pages, hardcover Review by

This book is a Festschrift that grew out of a workshop celebrating the 65th birthday of Grzegorz Rozenberg. Among many other accomplishments, Rozenberg coined the phrase “Natural Computing,” co-founded the journal of the same name, and also co-founded Theoretical Computer Science C (Theory of Natural Computing), and the Springer book series Natural Computing, of which this volume is a part. The...

Wilfried Brauer (1937-2014) in memoriam

At the end of February this year we received the sad tidings of the passing of Wilfried Brauer. Although not quite unexpected, the tidings still left us with a feeling of sorrow and longing. We had lost a close friend, a remarkable scientist and an influential administrator. Wilfried was one of the early pioneers of theoretical computer science in Europe. He was active in the founding stages of...

Journal of Universal Computer Science

In the prehistory of formal language theory: Gauss languages

The problem proposed by Gauss of characterizing the code of a simple crossing closed curve (SCCC, for short) can be considered a formal language question. We define three related infinite languages. Two of them are regular; the type of the third is an open problem.